On the Class Number of a Relatively Cyclic Number Field
نویسندگان
چکیده
منابع مشابه
The Class Number of the Cyclotomic Field.
1. Let g denote any odd prime and h = h(g) the class number of the cyclotomic field R(r), where r is the primitive gth root of unity, R the rational numbers. It is known that we can write: h = h1h2, where hi and h2 (both integers) are the so-called first and second factors of the class number; in fact h2 is the class number of the real field of degree 2 under R(r), namely the field R(D + D-). K...
متن کاملOn the Computation of the Class Number of an Algebraic Number Field
It is shown how the analytic class number formula can be used to produce an algorithm which efficiently computes the class number h of an algebraic number field F. The method assumes the truth of the Generalized Riemann Hypothesis in order to estimate the residue of the Dedekind zeta function of F at s = 1 sufficiently well that h can be determined unambiguously. Given the regulator R of F and ...
متن کاملA remark on the means of the number of divisors
We obtain the asymptotic expansion of the sequence with general term $frac{A_n}{G_n}$, where $A_n$ and $G_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$, with $d(n)$ denoting the number of positive divisors of $n$. Also, we obtain some explicit bounds concerning $G_n$ and $frac{A_n}{G_n}$.
متن کاملOn Class Group Computations Using the Number Field Sieve
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a variant of the quadratic sieve factoring algorithm. Paradoxical as it sounds, the principles of the number field sieve, in a strict sense, could not be applied to number field computations, yet. In this article we give an in...
متن کاملThe Number of Relatively Prime Subsets Of
A nonempty subset A ⊆ {1, 2 . . . , n} is relatively prime if gcd(A) = 1. Let f(n) denote the number of relatively prime subsets of {1, 2 . . . , n}. The sequence given by the values of f(n) is sequence A085945 in Sloane’s On-Line Encyclopedia of Integer Sequences. In this article we show that f(n) is never a square if n ≥ 2. Moreover, we show that reducing the terms of this sequence modulo any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1967
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000024119